搜索资源列表
prim1
- 最小生成树中prim算法的matlab代码，此算法可处理大数据的分类。-Prim minimum spanning tree algorithm matlab code, this classification algorithm can handle large data.
PRIM100
- 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
Prim101
- 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the min
zuixiaoshengchengshu
- 最小生成树算法,有n个城市可以用（n-1）条路将它们连通，求最小总路程的和。最小生成树算法，如Prim、Kruskal算法编写最小生成树程序输出最小生成树的各条边-Minimum spanning tree algorithm, there are n cities can use the (n-1) road will connect them, and find the smallest total distance. Respective sides of the minimum span
pulimu
- 普里姆算法最小生成树，和数据结构和算法的基础知识-Prim minimum spanning tree algorithm
PrimTree
- 最小生成树的普里姆算法PrimTree；在一个连通网的所有生成树中，各边的权值之和最小的那棵生成树称为该连通网的最小代价生成树（Minimum Cost Spanning Tree），简称为最小生成树。 -Prim minimum spanning tree algorithm in all spanning a communication network, the weight of each side and a minimum spanning tree is called the
minimum-spanning-tree
- 用c语言编写的最小生成树算法kruskal和prim-Using c language Minimum Spanning Tree Algorithm prim and kruskal
MST-
- 最小生成树的prim算法.可导入多种文件计算-Minimum spanning tree algorithm prim. You can import a variety of files on your computer
topological_sorting
- prim算法实现的拓扑排序，可以找出有向图中的环-prim topological sorting algorithm, you can find out in the ring to FIG.
616191算法作业
- 1.二分搜索技术2.最接近点对问题3.矩阵连乘问题4.电路布线5.单源最短路径Dijkstra算法6.最小生成树Prim算法7.最小生成树Kruskal算法C语言写的，全部能运行！(algorithm design assignment)
最小生成树
- C++最小生成树算法，提供给算法爱好者学习，有图的基本概念，邻接矩阵，prim算法等(Minimum spanning tree algorithm)